[hal-00670720, v1] Weight Distributions of Multi-Edge type LDPC Codes
نویسندگان
چکیده
The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the density evolution. key words: low-density parity-check code, structured codes, weight distributions
منابع مشابه
Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles
Multi-Edge type Low-Density Parity-Check codes (METLDPC codes) introduced by Richardson and Urbanke are generalized LDPC codes which can be seen as LDPC codes obtained by concatenating several standard (ir)regular LDPC codes. We prove in this paper that MET-LDPC code ensembles possess a certain symmetry with respect to their Average Coset Weight Distributions (ACWD). Using this symmetry, we dri...
متن کاملMulti-Edge Type LDPC Codes
We introduce multi-edge type LDPC codes, a generalization of the concept of irregular LDPC codes that yields improvements in performance, range of applications, adaptability and error floor. The multiedge type LDPC codes formalism includes various constructions that have been proposed in the literature including, among others, concatenated tree (CT) codes [1], (generalized irregular) repeat acc...
متن کاملA Joint Optimization Technique for Multi-Edge Type LDPC Codes
This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimization is particularly important for MET-LDPC c...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملStructured LDPC convolutional codes
LDPC convolutional codes, also known as spatially coupled LDPC codes, have attracted considerable attention due to their promising properties. By coupling the protographs from different positions into a chain and terminating the chain properly, the resulting convolutional-like LDPC code ensemble is able to produce capacityachieving performance in the limit of large parameters. In addition, opti...
متن کامل